Fractional Fibonacci groups with an odd number of generators

نویسندگان

چکیده

The Fibonacci groups F(n) are known to exhibit significantly different behaviour depending on the parity of n. We extend results for odd n family Fractional Fk/l(n). show that group Fk/l(n) is not fundamental an orientable hyperbolic 3-orbifold finite volume. obtain concerning existence torsion in (where odd) paying particular attention Fk(n) and Fk/l(3), observe consequences asphericity relative presentations their shift extensions. if Fk/l(3) non-cyclic 3-manifold then they isomorphic direct product quaternion Q8 a cyclic group.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lagged Fibonacci Random Number Generators for Distributed Memory Parallel Computers

To parallelize applications that require the use of random numbers, an efficient and good quality parallel random number generator is required. In this paper, we study the parallelization of lagged Fibonacci generators for distributed memory parallel computers. Two popular ways of generating a random sequence in parallel are studied: the contiguous subsequence technique and the leapfrog techniq...

متن کامل

On Fibonacci Keystream Generators

A number of keystream generators have been proposed which are based on Fibonacci sequences, and at least one has been elded. They are attractive in that they can use some of the security results from the theory of shift register based keystream generators, while running much more quickly in software. However, new designs bring new risks, and we show how a system proposed at last year's workshop...

متن کامل

High-dimensional knots corresponding to the fractional Fibonacci groups

We prove that the natural HNN-extensions of the fractional Fibonacci groups are the fundamental groups of high-dimensional knot complements. We also give some characterization and interpretation of these knots. In particular we show that some of them are 2-knots.

متن کامل

Combining the Solitaire Encryption Algorithm with Lagged Fibonacci Pseudorandom Number Generators

We use a “byte” variant of Bruce Schneier’s Solitaire EncryptionAlgorithm to produce the seed and weight system of a lagged Fibonacci pseu-dorandom number generator which generates a sequence of bytes. We analyzevariants of the procedure above by testing them using some up to date random-ness tests.MSC 2000. 65C10.

متن کامل

Random-number Generators Physical Random-number Generators

R andom numbers have applications in many areas: simulation, game-playing, cryptography, statistical sampling, evaluation of multiple integrals, particletransport calculations, and computations in statistical physics, to name a few. Since each application involves slightly different criteria for judging the “worthiness” of the random numbers generated, a variety of generators have been develope...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2022

ISSN: ['1879-3207', '0166-8641']

DOI: https://doi.org/10.1016/j.topol.2022.108083